Certifying Proofs in the First-Order Theory of Rewriting
نویسندگان
چکیده
Abstract The first-order theory of rewriting is a decidable for linear variable-separated rewrite systems. decision procedure based on tree automata techniques and recently we completed formalization in the Isabelle proof assistant. In this paper present certificate language that enables output software tools implementing to be formally verified. To show feasibility approach, , reincarnation tool with certifiable output, verified certifier .
منابع مشابه
the analysis of the role of the speech acts theory in translating and dubbing hollywood films
از محوری ترین اثراتی که یک فیلم سینمایی ایجاد می کند دیالوگ هایی است که هنرپیش گان فیلم میگویند. به زعم یک فیلم ساز, یک شیوه متأثر نمودن مخاطب از اثر منظوره نیروی گفتارهای گوینده, مثل نیروی عاطفی, ترس آور, غم انگیز, هیجان انگیز و غیره, است. این مطالعه به بررسی این مسأله مبادرت کرده است که آیا نیروی فراگفتاری هنرپیش گان به مثابه ی اعمال گفتاری در پنج فیلم هالیوودی در نسخه های دوبله شده باز تولید...
15 صفحه اولFrom Higher-Order to First-Order Rewriting
We show how higher-order rewriting may be encoded into rst-order rewriting modulo an equational theory E. We obtain a characterization of the class of higher-order rewriting systems which can be encoded by rst-order rewriting modulo an empty theory (that is, E = ;). This class includes of course the-calculus. Our technique does not rely on a particular substitution calculus but on a set of abst...
متن کاملHigher-Order Rewriting via Conditional First-Order Rewriting in the Open Calculus of Constructions
Although higher-order rewrite systems (HRS) seem to have a first-order flavor, the direct translation into first-order rewrite systems, using e.g. explicit substitutions, is by no means trivial. In this paper, we explore a two-stage approach, by showing how higher-order pattern rewrite systems, and in fact a somewhat more general class, can be expressed by conditional first-order rewriting in t...
متن کاملFirst-Order Proofs for Higher-Order Languages
We study the use of the-calculus for semantical descriptions of higher-order concurrent languages with state. As an example, we choose Concurrent Idealized ALGOL (CIA). CIA is particularly interesting as, yet being a core language, it combines imperative and parallel features with a procedural mechanism of full higher order. It can thus be used as a formal model for concurrent programs as, e.g....
متن کاملEncoding First Order Proofs in SAT
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau and the satisfiability of unification constraints. Then the first order theorem is rigidly unsatisfiable if and only if the encoding is propositionally satisfiable. We have implemented this method in our theorem prover ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-72013-1_7